Modularity and Petri Nets

The systems to model are nowadays very large. Their specification is often decomposed into several steps. This leads to modularly or incrementally designed models. Petri nets analysis is generally achieved via state space analysis, which is often impossible to perform due to the so-called state space explosion problem. Several methods allow to reduce the occurrence graph size, e.g. using partial orders, symmetries, ... Here, we focus on techniques which take advantage of the modular design of the system, and hence build the state space in a modular or incremental way

Towards a methodology for modelling with Petri nets

Formal specifications remain difficult to write in general, due to both the complexity of the system to be developed, and the use of a formal language. In [CR03a], a method is proposed for specification development, with CASL, the Common Algebraic Specification Language, and CASL-LTL, an extension for dynamic systems specification, as target languages. However, this method could be used with quite a variety of modeling languages, as shown in this paper which is a first attempt to provide systematic guidelines for Petri net specification on the ground of the aforementioned specification method. It is shown how to express in terms of Petri nets the constituent features and the properties exhibited from the first specification approach. A model train specification from [BP00] is used as a running example

From PNML to counter systems for accelerating Petri Nets with FAST

We use the tool FAST to check parameterized safety properties on Petri nets with a large or infinite state space. Although this tool is not dedicated to Petri nets, it can be used for these as place/transition nets (and some of their extensions) are subcases of FASTinput model. The originality of the tool lies in the use of acceleration techniques in order to compute the exact reachability set for infinite systems. In this paper, we present the automatic transformation of Petri nets written in PNML (Petri Net Markup Language) into counter systems. Then, FAST provides a simple but very powerful language to express complex properties and check these

COAST : des réseaux de Petri à la planification assistée

COAST est un outil d'assistance à la planification militaire. Son architecture distribuée comprend un serveur constitué d'un moteur d'analyse de réseaux de Petri tandis que l'interface graphique fournie par le client permet de masquer l'utilisation des méthodes formelles. Les synchronisations entre tâches à planifier sont un aspect essentiel de COAST. Dans cet article, après une présentation générale de la problématique et de l'outil, nous décrivons les synchronisations, montrons comment elles sont modélisées et implantées

Modular State Space Analysis of Coloured Petri Nets

State Space Analysis is one of the most developed analysis methods for Petri Nets. The main problem of state space analysis is the size of the state spaces. Several ways to reduce it have been proposed but cannot yet handle industrial size systems.Large models often consist of a set of modules. Local properties of each module can be checked separately, before checking the validity of the entire system. We want to avoid the construction of a single state space of the entire system.When considering transition sharing, the behaviour of the total system can be capture by the state spaces of modules combined with a Synchronisation Graph. To verify that we do not lose information we show how the full state space can be conctructed.We show how it is possible to determine usual Petri Nets properites, without unfolding to the ordinary state space

An intelligent peer-to-peer multi-agent system for collaborative management of bibliographic databases

This paper describes the design of a peer-to-peer system for collaborative management of distributed bibliographical databases. The goal of this system is twofold: firstly, it aims at providing help for users to manage their local bibliographical databases. Secondly, it offers the possibility to exchange bibliographical data among like-minded user groups in an implicit and intelligent manner. Each user is assisted by a personal agent that provides help such as: filling in bibliographical records, verifying the correctness of information entered and more importantly, recommendation of relevant bibliographical references. To do this, the personal agent needs to collaborate with its peers in order to get relevant recommendations. Each agent applies a case-based reasoning approach in order to provide peers with requested recommendations. The paper focuses mainly on describing the recommendation computation approach

Parameter Synthesis for Parametric Interval Markov Chains

AELOS_HCERES2020, STR_HCERES2020Interval Markov Chains (IMCs) are the base of a classic probabilistic specification theory introduced by Larsen and Jonsson in 1991. They are also a popular abstraction for probabilistic systems. In this paper we study parameter synthesis for a parametric extension of Interval Markov Chains in which the endpoints of intervals may be replaced with parameters. In particular, we propose constructions for the synthesis of all parameter values ensuring several properties such as consistency and consistent reachability in both the existential and universal settings with respect to implementations. We also discuss how our constructions can be modified in order to synthesise all parameter values ensuring other typical properties

Coloured Petri Net Refinement Specification and Correctness Proof with Coq

In this work, we address the formalisation of symmetric nets, a subclass of coloured Petri nets, refinement in COQ. We first provide a formalisation of the net models, and of their type refinement in COQ. Then the COQ proof assistant is used to prove the refinement correctness lemma. An example adapted from a protocol example illustrates our work

Parametric model checking timed automata under non-Zenoness assumption

International audienc